Recursively saturated $\omega_1$-like models of arithmetic.
نویسندگان
چکیده
منابع مشابه
Degrees of Recursively Saturated Models
Using relativizations of results of Goncharov and Peretyat'kin on decidable homogeneous models, we prove that if M is S-saturated for some Scott set S, and F is an enumeration of S, then M has a presentation recursive in F. Applying this result we are able to classify degrees coding (i) the reducts of models of PA to addition or multiplication, (ii) internally finite initial segments and (iii) ...
متن کاملRecursively Saturated Models of Set Theory
We determine when a model 90? of ZF can be expanded to a model <SW, %y of a weak extension of Godel Bernays: GB + the A] comprehension axiom. For nonstandard W, the ordinal of the standard part of ÜR must equal the inductive closure ordinal of SK, and 2J? must satisfy the axioms of ZF with replacement and separation for formulas involving predicates for all hyperelementary relations on SK. We a...
متن کاملConstructing Κ-like Models of Arithmetic
A model (M,!,...) is κ-like if M has cardinality κ but, for all a `M, the cardinality of 2x `M : x! a ́ is strictly less than κ. In this paper we shall give constructions of κ-like models of arithmetic satisfying an arbitrarily large finite part of PA but not PA itself, for various singular cardinals κ. The main results are : (1) for each countable nonstandard MzΠ # ®Th(PA) with arbitrarily larg...
متن کاملA Valuation Theoretic Characterization of Recursively saturated Real Closed Fields
We give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in in [KKMZ02], where the authors gave such a characterization for κ-saturation, for a cardinal κ ≥ א0. Our result extends the characterization of Harnik and Ressayre [HR] for a divisible ordered abelian group to be recursively saturated.
متن کاملThe Automorphism Group of a Countable Recursively Saturated Structure
The automorphism groups of K0-categorical structures have been studied extensively by both permutation group theorists and model theorists, and this collaboration has turned out to be very fruitful. (See, for example, [10,6,2].) The notion of a recursively saturated structure generalizes that of a (countable) X0-saturated structure, and countably infinite recursively saturated structures also h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1985
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093870932